Where the Typical Set Partitions Meet and Join

نویسنده

  • Boris Pittel
چکیده

The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability that the coarsest refinement of all pi ’s is the finest partition {1}, . . . , {n} is shown to approach 0 for r = 2, and 1 for r ≥ 3. The probability that the finest coarsening of all pi ’s is the one-block partition is shown to approach 1 for every r ≥ 2. Introduction. Let Πn be the set of all set partitions of [n] , ordered by refinement. That is, for two partitions p and p′ , p p′ if each block of p′ is a union of blocks of p . It is well known, Stanley [6], that Πn is a lattice; it means that every pair of partitions p, p′ has the greatest lower bound inf{p, p′} (p inf p′ or p meet p′ ) and the least upper bound sup{p, p′} (p sup p′ or p join p′ ). Namely, inf{p, p′} is the partition whose blocks are the pairwise intersections of blocks of p and p′ , and it is the “coarsest” (simultaneous) refinement of p and p′ . sup{p, p′} is a partition whose every block is both a union of blocks of p and a union of blocks of p′ , with no proper subset of the block having that property; so it is the finest “coarsening” of p and p′ . Assigning to each p the same probability, 1/|Πn| , we transform Πn into the probability space with uniform measure. There is a sizeable literature on the properties of the uniformly distributed partition, see Pittel [5] and the references therein. Closer to the subject of this paper, Canfield and Harper [1] and Canfield [2] used the probabilistic tools to find the surprisingly sharp bounds for the length of the largest antichain in Πn . In [5] we proved that the total number of refinements of the random partition is asymptotically lognormal. In the present paper we study the properties of inf1≤i≤r pi , sup1≤i≤r pi , under the assumption that the uniform partitions p1, . . . , pr are independent. (Formally, we study 1991 Mathematics Subject Classification. 05A18, 05A19, 05C30, 05C80, 06A07, 60C05, 60Fxx.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Meet and Join within the Lattice of Set Partitions

We build on work of Boris Pittel [5] concerning the number of t-tuples of partitions whose meet (join) is the minimal (maximal) element in the lattice of set partitions.

متن کامل

k-Efficient partitions of graphs

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

متن کامل

Stirling number of the fourth kind and lucky partitions of a finite set

The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.

متن کامل

On Spatially Partitioned Temporal Join

This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to points in a two dimensional space and partitions the space into subspaces. Tupies of a temporal relation are clustered into partitions based on the mapping in the space. As a result, when two temporal relations are to ...

متن کامل

Orbit Coherence in Permutation Groups

For G ≤ Sym(Ω), let π(G) be the set of partitions of Ω given by the cycles of elements of G. Under the refinement order, π(G) admits join and meet operations. We say thatG is joinor meet-coherent if π(G) is joinor meet-closed, respectively. The centralizer in Sym(Ω) of any permutation g is shown to be meetcoherent, and join-coherent subject to a finiteness condition. Hence if G is a centralizer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2000